More strategies, more Nash equilibria
نویسندگان
چکیده
This short paper isolates a non-trivial class of games for which there exists a monotone relation between the size of pure strategy spaces and the number of pure Nash equilibria (Theorem). This class is that of two-player nice games, i.e., games with compact real intervals as strategy spaces and continuous and strictly quasi-concave payoff functions, assumptions met by many economic models. We then show that the sufficient conditions for Theorem to hold are tight.
منابع مشابه
Weihrauch Degrees of Finding Equilibria in Sequential Games
We consider the degrees of non-computability (Weihrauch degrees) of finding winning strategies (or more generally, Nash equilibria) in infinite sequential games with certain winning sets (or more generally, outcome sets). In particular, we show that as the complexity of the winning sets increases in the difference hierarchy, the complexity of constructing winning strategies increases in the eff...
متن کاملMore strategies, more Nash equilibria ∗ Sophie Bade
In this paper, we isolate a non-trivial class of games for which there exists a monotone relation between the size of strategy spaces and the number of Nash equilibria. This class is that of two-player games with compact real intervals as strategy spaces and continuous and strictly quasi-concave payoff functions, assumptions met by many economic models. We then show that the sufficient conditio...
متن کاملDynamical selection of Nash equilibria using Experience Weighted Attraction Learning: emergence of heterogeneous mixed equilibria
We study the distribution of strategies in a large game that models how agents choose among different double auction markets. We classify the possible mean field Nash equilibria, which include potentially segregated states where an agent population can split into subpopulations adopting different strategies. As the game is aggregative, the actual equilibrium strategy distributions remain undete...
متن کاملComputing Nash equilibria through computational intelligence methods
Nash equilibrium constitutes a central solution concept in game theory. The task of detecting the Nash equilibria of a finite strategic game remains a challenging problem up-to-date. This paper investigates the effectiveness of three computational intelligence techniques, namely, covariance matrix adaptation evolution strategies, particle swarm optimization, as well as, differential evolution, ...
متن کاملAlgorithms for Approximations of Nash Equilibrium ( 2003 ; Lipton , Markakis , Mehta , 2006
Nash [13] introduced the concept of Nash equilibria in non-cooperative games and proved that any game possesses at least one such equilibrium. A well-known algorithm for computing a Nash equilibrium of a 2-player game is the Lemke-Howson algorithm [11], however it has exponential worst-case running time in the number of available pure strategies [15]. Recently, Daskalakis et al [4] showed that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Economic Theory
دوره 135 شماره
صفحات -
تاریخ انتشار 2007